On Group-theoretic Models of Randomness and Genericity
نویسنده
چکیده
We compare the random group model of Gromov and the model of generic groups of Arzhantseva and Ol’shanskii.
منابع مشابه
Generalized Vershik’s Theorem and Generic Metric Structures
We compare three notions of genericity of separable metric structures. Our analysis provides a general model theoretic technique of showing that structures are generic in discriptive set theoretic (topological) sense and in measure theoretic sense. In particular, it gives a new perspective on Vershik’s theorems on genericity and randomness of Urysohn’s space among separable metric spaces.
متن کاملGeneric Separable Metric Structures
We compare three notions of genericity of separable metric structures. Our analysis provides a general model theoretic technique of showing that structures are generic in descriptive set theoretic (topological) sense and in measure theoretic sense. In particular, it gives a new perspective on Vershik’s theorems on genericity and randomness of Urysohn’s space among separable metric spaces.
متن کاملThe Typical Turing Degree
The Turing degree of a real measures the computational difficulty of producing its binary expansion. Since Turing degrees are tailsets, it follows from Kolmogorov’s 0-1 law that for any property which may or may not be satisfied by any given Turing degree, the satisfying class will either be of Lebesgue measure 0 or 1, so long as it is measurable. So either the typical degree satisfies the prop...
متن کاملLowness for Weak Genericity and Randomness
We prove that lowness for weak genericity is equivalent to semicomputable traceability which is strictly between hyperimmune-freeness and computable traceability. We also show that semi-computable traceability implies lowness for weak randomness. These results refute a conjecture raised by several people.
متن کاملA measure-theoretic proof of Turing incomparability
We prove that if S is an ω-model of weak weak König’s lemma and A ∈ S, A ⊆ ω, is incomputable, then there exists B ∈ S, B ⊆ ω, such that A and B are Turing incomparable. This extends a recent result of Kučera and Slaman who proved that if S0 is a Scott set (i.e. an ω-model of weak König’s lemma) and A ∈ S0, A ⊆ ω, is incomputable, then there exists B ∈ S0, B ⊆ ω, such that A and B are Turing in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007